A bi-objective model for robust local container drayage problem

Local Container Drayage Problem (LCDP) refers to the optimization of process planning and scheduling container trucks between a terminal customers offer door-to-door service in local area. The time required for (un)packing containers at customers’ sites are often relatively long uncertain due current work level unexpected deviations operational situations, which has significant influence on transportation process. This paper examines LCDP with Separable tractors trailers, additionally consideration Uncertainties (LCDPSU). A proactive strategy is employed tackle uncertainty by proposing “model robust” bi-objective model balance tradeoff cost, includes traveling cost tractor deployment setup robustness, represented as an exponential expression buffer two stages each individual task. deterministic version our problem proved be NP hard, Ant Colony Optimization (ACO) scheme therefore proposed search feasible solutions Zoutendijk direction algorithm embedded order nonlinearity brought robustness model. Numerical experiments conducted validate efficiencies effectivenesses models methods, managerial implications drawn from numerical results.